Data beacon pulser(s) powered by information slingshot

ABSTRACT

Systems and methods for providing data beacons are disclosed. In some embodiments the system can include a first node and a second node. Each node includes a read queue, a write queue and a parallel file system. Data is written from the write queue on the first node to the parallel file system on the second node and from the write queue on the second node to the parallel file system on the first node. The read queue on each node receives data from the parallel file system on the node itself.

RELATED APPLICATIONS

This application claims benefit to U.S. Provisional Application No.62/327,907 filed on Apr. 26, 2016, which is incorporated herein byreference. This application claims benefit to U.S. ProvisionalApplication No. 62/327,846, filed on Apr. 26, 2016, which isincorporated herein by reference. This application claims benefit toU.S. Provisional Application No. 62/327,911, filed on Apr. 26, 2016,which is incorporated herein by reference.

This application also relates to the following applications, content ofwhich are hereby incorporated by reference: International PatentApplication Nos., PCT/IB16/01867, filed on Dec. 9, 2016; PCT/US15/64242,filed on Dec. 7, 2015; PCT/IB16/00110, filed on Jan. 5, 2016;PCT/US16/15278, filed on Jan. 28, 2016; PCT/IB16/00528, filed on Apr. 7,2016; PCT/IB16/00531, filed on Apr. 7, 2016; PCT/US16/26489, filed onApr. 7, 2016; PCT/IB16/01161, filed on Jun. 13, 2016.

BACKGROUND OF THE INVENTION Technical Field

The present disclosure relates generally to networks, and moreparticularly, to the topology, configuration and operation of a databeacon pulser (DBP). A DBP offers fast, efficient, and dependableone-way casting/multi-casting of information globally. A DBP can beutilized for transmission of financial data, news feeds, seismic data,and many other applications where dependable and accurate near wirespeed dissemination of rapidly changing information is time critical.

Description of the Related Art

The technology powering a data beacon pulser (DBP) is based on slingshottechnology as described in U.S. Provisional Application Nos. 62/296,257and 62/266,060 and in PCT US/16/65856 entitled “SYSTEM AND METHOD FORINFORMATION SLINGSHOT OVER A NETWORK TAPESTRY AND GRANULARITY OF ATICK.” The DBP can also utilize and integrate into the topology of aglobal virtual network (GVN) as described in International PatentApplication No. PCT/US16/15278 entitled “SYSTEM AND METHOD FOR A GLOBALVIRTUAL NETWORK.”

Comparison of prior art for DBP technology is based on the laws ofphysics, specifically in relation to the speed of light and of how itrelates to the transmission of information in the form of data, overvarious transmission mediums but specifically wire speed over fiberoptic cables, via microwave or other wireless transmissions, over copperwire or other mediums. Time and the duration of time (Δt) are importantmeasures of performance and indicators of the preeminence of one optionversus others.

As a further illustration of background, the rules of physics act as afoundation for references made herein to time, latency, wire speed, andother time dependent measures. As time and distance are significant,this invention uses the following baseline for time and distance/timereferences. Distances herein are measured in miles under the imperialsystem. Measures of distance herein can be a number with or withoutcommas, and/or decimals or expressed as an integer. One exception fordistances herein which do not use the Imperial system is in theRefractive Index of Fiber Optic Cables where the distances are expressedin meters under the metric system. Unless otherwise noted, time ismeasured in seconds, expressed as integers, fractions and/or decimals ofseconds. For example, the granularity of a tick of time can be measuredeither as a fraction (Every 1/20^(th) or 1/10^(th) or 1/100^(th)) or asdecimals (0.05, 0.1, 0.01) of a millisecond. Time units referencedherein may also be finer granularity than seconds, such as milliseconds(ms) and microseconds (μs), nanoseconds (ns), or other. Any granularityfiner than microseconds such as nanoseconds (ns) may be important incertain practical applications of this invention but for sake ofdemonstration, finest practical granularity herein is μs. In computing,the most common measure of time for networking is milliseconds (ms) andfor processing is microseconds (μs) or smaller.

The following table illustrates some possible values and theircorresponding equivalent conversion.

TABLE 1 measures of time Milliseconds Microseconds # Description Seconds(ms) (μs) 1 1/10th of a second 0.10000 100 100,000 2 1/20th of a second0.05000 50 50,000 3 1/100th of a second 0.01000 10 10,000 4  10microseconds 0.00001 0.010 10 5 100 microseconds 0.00010 0.100 100 61,000 microseconds  0.00100 1.000 1,000

The global internet is a mesh of networks interconnected to each otherutilizing standardized network protocols and other methods to ensure endto end connectivity. The majority of the internet is based on Ethernetand specifically, the most widely used protocol is internet protocol(IP) running over Ethernet. The two main types of communicationprotocols on top of IP in use on the internet are Transmission ControlProtocol (TCP) and User Datagram Protocol (UDP); each of TCP/IP andUDP/IP has their own benefits and draw backs.

Devices connect to each other on the internet as one host communicatingwith another host. The topological relationships between hosts can beeither client-server (C-S) where the clients make requests to the serverwhich may or may not accept the request. If the request is accepted, theserver can process the request and return a response back to the client.Alternatively, hosts may be defined as equal peers which communicatewith each other in peer-to-peer (P2P) exchanges.

P2P and C-S typically utilize round-trip request-response pathways.TCP/IP is the most widely used protocol for P2P and C-S traffic. Thespeed of an internet pathway is therefore generally measured asround-trip time (RTT).

Information publishers like financial market exchanges share data fromtheir central locations via UDP multi-cast streams or similar methods.For clients in regions far away from the source, receipt of informationby a server in that client's region will receive the UDP stream ofinformation, aggregate it on a server and make it available for clientsto make REQ-RESP queries for information. Information can also beaccumulated in the source region on a source server and replicated on aserver in another region in CDN like operations.

Over a long distance the efficiency of TCP/IP and UDP/IP over Ethernetpresent certain challenges. Techniques have been developed to try toforce data to flow down the best path and include OSPF (open shortestpath first), BGP routing (Border Gate Protocol) and other peeringrelated technologies.

For those who can afford the high cost, the market makes availablededicated or private lines and related technologies like MPLS(Multiprotocol Label Switching), Dark Fiber, etc., offer lines withmainly direct connectivity between points with guaranteed QoS (Qualityof Service), mitigation against congestion from others, and otherassurances.

Optimized financial lines and superfast hardware together strive to makethe path and subsequent transit time as lean and as fast as possible.Information services such as Bloomberg which makes financial terminalsavailable to traders also use top of the line devices to make UDP/IP andTCP/IP transport as efficient as possible.

WAN Optimization devices and software work to compress and optimize thedata transmitted between the two end points of the WAN. A Global VirtualNetwork (GVN) optimizes peering, utilizes AI and advanced smart routing(ASR) and other technologies to improve network performance.

All of the above technologies follow the current communicationsmethodology for transmission of data packets between origin anddestination with a round-trip back to origin, with transmission timesreflected as a measure of RTT or round-trip time.

Infiniband (IB) over distance is also possible with the positioning oftwo end-point InfiniBand enabled boxes at either end of a dark fiberpathway to realize long distance InfiniBand connectivity. Other networktypes may offer the same advantages as an alternative to IB overdistance.

Slingshot one-way sending (U.S. Provisional Patent 62/266,060 referencedherein) offers certain advantages to the reliable movement of data atnear wire-speed.

There are various drawbacks associated with prior art technologies.Internet Protocol (IP) over Ethernet becomes extremely inefficient overlong distances and its utility decreases when there is congestion, poorrouting, slower speeds, peering between different markets, or thepresence of other events.

Physical limitations of a line also present challenges. Due to the lawof physics, transmission of light over fiber optic lines cannot reachthe speed of light in a vacuum.

TABLE 2 fiber line speed taking into account drag on optical fiberlatency due to refraction miles/second miles/second fiber in a vacuumthrough fiber efficiency Speed of light 186,282.34 126,759.88 68.05%

Table 2 compares the speed of light in a vacuum to the speed of lightinside of the glass core of optical fiber and is based on data fromhttp://www.m2optics.com/blog/bid/70587/Calculating-Optical-Fiber-Latency.Accordingly, there is a physical limitation to fiber efficiency whichestablishes a baseline for the theoretical best speed that can beachieved for light to travel through fiber, referred to as wire speed.

While the Refractive Index of fiber optic cables may vary slightly, anaverage is assumed as follows: Average of approx. 203 m/μs to 204 m/μsvs. speed of light of 299.792 m/μs for an average efficiency of 68.05%.

Therefore, transmission speed over fiber is 126,759.88 miles per secondand is the fastest possible wire-speed which can be achieved.

For information exchange, it requires at least two round-trips (RTT).The Request-Response nature of round-trip transmission on today'sinternet (and corresponding RTT measurements of elapsed time) requiresone host to query another host for information to be returned.Accordingly, host to host communication and drag over extended pathscreates inefficiencies. But it is not that simple because thepacketization of data traffic also leads to inefficiencies. As well asheaders, packet size limits, multi-part payloads for files, and otherissues.

For example, if using TCP/IP for the conveyance of market informationthe REQ-RESP RTT model wastes time from the client to the server whenall that is required is a one way sending from server to client. Mostfinancial exchanges share market information by UDP one-way streams.UPD/IP like TCP/IP must contend with congestion issues, loss, and moreissues endemic to IP over Ethernet. The further away the host whichrequires the information is from the host which provides theinformation, the more prevalent the problems and the lower theefficiency of IP. Distance amplifies the problems and slows theinformation flow in a non-linear progression with slower times overdistance.

For example, where CDN content is made available on a server very closeto the client, the information from source server still needs to bereplicated over distance. While a client may be able to shorten RTT to aCDN server near it (the client), the underlying data still needs to bepublished or otherwise replicated from a source CDN server. Therefore,this methodology can still have a detrimental effect on the timerequired for information conveyance and on its availability.

A private line and/or optimized financial sector line may be able tosave precious time off the internet time. Such lines are typically hivedoff from public pathways and so spillover problems and congestion issuesare abated. However, congestion issues and other problems endemic to IPcan still be prevalent at times.

The UDP/IP multi-cast streams can drop packets during times ofcongestion or due to other IP issues. In the case of dropped packets,there is no way for the receiver to know that there was a problem andbecause UDP does not have the same error correction and provision toresend a lost packet that TCP/IP has, gaps of information can occur. Andbecause the intended receiver of UDP/IP packets does not send anacknowledgement (ACK) packet, the sender does not know that the receiverdid not receive it.

Using TCP/IP avoids information gaps of UDP/IP but at the cost of speedand the need to retransmit lost, corrupt or otherwise undelivered TCP/IPpackets. It offers more reliability but is relatively slower and whenneeded most, during times of heavy activity, congestion leads to higherlatency and to loss.

Getting complete visibility of rapidly changing information frommultiple sources via TCP/IP and UPD/IP is possible but the inherentproblems of the TCP/IP roundtrip requirement combined with the potentialfor unknown loss via UPD/IP presents a less than ideal situation.

Because of the interconnectedness of the world and the need for the mostcurrent information, speed of information transmission is critical butthe information must be complete and accurate. For example, somesecurities, commodities, currencies or other financial products areconcurrently traded on different markets in various regions and thechange in one market will influence the activity in another market. Thismeans that a globally traded commodity or currency or other financialinstrument requires timely information from multiple markets fromdifferent regions to be aggregated in real time.

In the case of publishing of market data, exchanges are local and to geta complete picture traders need to receive data streams from multipledifferent exchanges, markets, and other places to obtain currentinformation. Therefore, trading houses receive UDP multi-cast feeds frommany markets into a consolidation point gathering packets andaggregating them for analysis and further dissemination.

There is a need for rapidly changing information to be made available ina timely basis to reflect market changes as they happen at all places atonce. The financial market imperatives are but one high profile exampleof industry application of Data Beacon Pulser, however, this technologycan be utilized by many other sectors, including academic, scientific,military, healthcare, and other areas.

The invention overcomes the distance issues associated with TCP/IP andUDP/IP because the underlying protocol of Slingshot powering DBP doesnot have the same congestion and inefficiencies problems over distance.In the case of repeat queries to fast moving and rapidly changinginformation, especially during times of heavy activity, UDP/IP andTCP/IP are subject to congestion events and subsequent packet loss.UDP/IP will simply drop packets without receiver nor sender being awareof this loss leading to imperfect visibility of market info. Data BeaconPulser addresses this by offering reliability and speed superior toUDP/IP and TCP/IP over distance.

While the financial industry was used as an example of mission criticalneed for complete and accurate and fast transmission of data, many otherindustries and sectors have their own criticality around speed ofdelivery, and in some cases, the sheer volume of data such as intransmission of large medical diagnostic images, this volume of data canalso overwhelm IP networks with congestion which leads to slowdowns.

Data Beacon Pulser can be used in financial technology networking(FinTech). It provides advantages over the current state of the art suchas UDP one-way multi-casting vs DBP utilizing slingshot. DBP FinTech hasimportant application to price discovery where accuracy, timing, andscope of information are critical to trade decision making as the basisfor order execution order/confirmation. The focus on value in financialmarkets is an example only as a DBP may be applicable in many otherindustries. Those with sufficient knowledge and skill can utilize DBPfor many other applications.

For example, DBP provides the following features. DBP provides one-wayBeacon transfer from source to target as regular, constantflashes/pulses address the limitations of client-server (C-S) orpeer-to-peer (P2P) round-trip times (RTT). The unlimited file size ofDBP address issues with IP protocol packetization of files and data. Theability to send complete file sizes eliminates the need to break a fileinto multiple parts to be carried by a stream of multiple packets,enhancing efficiency.

The dynamic adjustment of the pulse rate of the Data Beacon Pulser (DBP)is governed by the granularity of a tick with very fine granularity downto microsecond and even nanosecond sensitivity and permits very currentand fresh information to be made available. The technology for thegranularity of a tick is described in U.S. Provisional Application No.62/296,257 and PCT US/16/65856 entitled “SYSTEM AND METHOD FORINFORMATION SLINGSHOT OVER A NETWORK TAPESTRY AND GRANULARITY OF ATICK.” The receiving of information from multiple Beacons andaggregation provides more thorough information which can be analyzed inas close to real time as possible. The backbone exchange server(SRV_BBX) and sling node (SLN) and inquiry server (SRV_INC) at thesource region can be programmed to capture and/or fetch information forsending by DBP in as wide or narrow a range as client preferencesindicate.

In addition, the integration of DBP is an efficient use of time andresources because remote clients receive information eliminating themneeding to request that information over long distance. The eliminationof RTT and protocol drag improves performance. Traditional RTT via aflavor of IP uses store and forward framework where packets must bereceived by a device in full before being forwarded. Beacon transferuses a cut-through method at its Slingshot core where information isreceived and forwarded by devices as soon as header information isreceived. Sending complete files via RDMA vs multipart files via packetsis better because it avoids packet bloat, packetization and reassemblywhich require computing resources but more importantly add drag andadded time.

The addition of some processing time to the data flow at the source andat the target region is compensated by a gain in wire speed efficiencyof between 92% and 98% at the middle by Slingshot transport. This gainin wire speed efficiency compares with as the approximate 23% to 60%efficiency associated with native TCP/IP transport over a long distance.

TABLE 3 Ethernet IP Round-Trip-Time (RTT) versus Fiber Backbone (FBB)Latency: Internet IP RTT Point-to-Point FBB - one way Latency Locationsmin./avg. Distance Wirespeed # From To (ms) (miles) MillisecondsMicroseconds 1 New York London 65/73 3,465 27.3 27,335 2 Hong KongLondon 174/217 5,969 47.1 47,089 3 New York Singapore 209.7/241  9,53875.2 75,245 4 New York Los Angeles 67/69 2,448 19.3 19,312 5 New YorkTokyo 142/172 6,737 53.1 53,148 6 New York Frankfurt 73.4/87  3,858 30.430,435 7 New York Hong Kong 191.6/253  8,058 63.6 63,569 8 New YorkParis 82/85 3,631 28.6 28,645 9 New York Sydney 233/261 9,946 78.578,463 10 Los Angeles London 131/144 5,447 43.0 42,971 11 Los AngelesHong Kong 168/168 7,245 57.2 57,155 12 Los Angeles Singapore 193/2158,788 69.3 69,328 13 Los Angeles Sydney 163/166 7,497 59.1 59,143 14London Sydney 294/298 10,571 83.4 83,394 15 London Singapore 172/1886,748 53.2 53,235 16 London Frankfurt  9/20 396 3.1 3,124 17 Tokyo HongKong 43/55 1,788 14.1 14,105 18 Tokyo London 207/238 5,936 46.8 46,80019 Hong Kong Singapore 30/31 1,609 12.7 12,693 20 Point A A + 100 miles— ms 100 0.8 789 21 Point A A + 1000 miles — ms 1,000 7.9 7,889 22 PointA A + 12000 miles — ms 12,000 94.7 94,667 Sources for Data:https://www.sprint.net/lg/lg_start.phphttp://www.verizonenterprise.eom/about/network/latency/#latencyhttps://wondemetwork.com/pings/Hong+Konghttps://ipnetwork.bgtmo.ip.att.net/pws/network_delay.htmlhttps://ipnetwork.bgtmo.ip.att.net/pws/global_network_avgs.html

SUMMARY OF THE DISCLOSURE

Systems and methods for providing data beacons are disclosed. In someembodiments, the system can include a first node and a second node. Eachnode includes a read queue, a write queue and a parallel file system.Data is written from the write queue on the first node to the parallelfile system on the second node and from the write queue on the secondnode to the parallel file system on the first node. The read queue oneach node receives data from the parallel file system on the nodeitself.

In some embodiments, the data is written as a carrier file comprising aheader, a body, and a footer. In other embodiments, the nodes write dataat a set frequency. In some embodiments, additional data is written thatcontains only information that has changed since the prior data waswritten.

In some embodiments data is written from the first node to a parallelfile system on a third node.

BRIEF DESCRIPTION OF THE DRAWINGS

In order to facilitate a fuller understanding of the present disclosure,reference is now made to the accompanying drawings, in which likeelements are referenced with like numerals or references. These drawingsshould not be construed as limiting the present disclosure, but areintended to be illustrative only.

FIG. 1 illustrates a client-server (C-S) or peer-to-peer (P2P)Request-Response Framework.

FIG. 2 illustrates a Global Virtual Network (GVN).

FIG. 3 illustrates the packet bloat for IP transport packets whenheaders are added to the data at various layers.

FIG. 4 illustrates the packet bloat of data and headers at each of theseven layers of the OSI model.

FIG. 5 illustrates layers under the Internet (UTI) mapped to Over theTop (OTT) layers.

FIG. 6 illustrates Slinghop with the composition of a file as clump ofpackets.

FIG. 7 illustrates an example of Slinghop information flow.

FIG. 8 illustrates the synchronization of pulling of batches of files.

FIG. 9 illustrates a file with payload body data section consisting ofvarious content types.

FIG. 10 illustrates Slingshot with End Points Pairs (EPP) Topologyoverlaid on map of northern hemisphere.

FIG. 11 illustrates Sling-Routing with a ring of global nodes.

FIG. 12 illustrates Sling-Routing with Targeted Write to PFS to routetraffic FIG. 13 illustrates one example of the Beacon mechanismframework and flow.

FIG. 14 illustrates the round-trip-time for transmitting marketinformation.

FIG. 15 illustrates the timing for transmitting market information withdata beacon pulser and slingshot.

FIG. 16 illustrates the timing for transmitting market information withdata beacon pulser.

FIG. 17 illustrates the round-trip-time for transmitting marketinformation and the timing for data beacon pulser.

FIG. 18 illustrates a series of data beacon pulses.

FIG. 19 illustrates simultaneous data beacon pulses.

FIG. 20 illustrates the intersection of multiple pulses and flashes.

FIG. 21 illustrates the timing for an example stock trade.

FIG. 22 illustrates the timing for an example stock trade.

FIG. 23 illustrates the timing for an example stock trade.

FIG. 24 illustrates the granularity of a tick.

FIG. 25 illustrates how the GVN can incorporate technologies such asNetwork Slingshot.

FIG. 26 illustrates a system diagram with Beacon and other logic.

DETAILED DESCRIPTION

In the following description, numerous specific details are set forthregarding the systems, methods and media of the disclosed subject matterand the environment in which such systems, methods and media mayoperate, etc., in order to provide a thorough understanding of thedisclosed subject matter. It will be apparent to one skilled in the art,however, that the disclosed subject matter may be practiced without suchspecific details, and that certain features, which are well known in theart, are not described in detail in order to avoid complication of thedisclosed subject matter. In addition, it will be understood that theexamples provided below are exemplary, and that it is contemplated thatthere are other systems, methods, and media that are within the scope ofthe disclosed subject matter.

Data Beacon Pulser is a solution that facilitates realization of thebenefit(s) of the speed of UDP (or faster) with the reliability of TCP.A constantly pinging Beacon utilizes the technology of network slingshotto send any-sized data from one source region to a target region. Thetechnology for slingshot is described in U.S. Provisional ApplicationNo. 62/266,060 entitled “INFORMATION SLINGSHOT OVER A NETWORK TAPESTRY”and in PCT US/16/65856 entitled “SYSTEM AND METHOD FOR INFORMATIONSLINGSHOT OVER A NETWORK TAPESTRY AND GRANULARITY OF A TICK.”

A Data Beacon Pulser (DBP) super computer node (SCN) at the source isconfigured and programmed to capture which data to locally retrieve (viarequest) and/or capture (from a stream) or access directly via itsmemory or connected storage and it will constantly pull in theinformation and then use slingshot to transfer the information data tothe target region.

To scale DBP two supercomputer distributed nodes are utilized. ScalingDBP is achieved by placing various nodes at distributed locations andhaving one Beacon send, and another receive to make data available tolocal devices in a target receiving region.

The way the DBP works is that the SCN in the target region (informationsource) can be remotely configured by the client in a remote region togather information in which the client is interested (and related info)and make it available via the other node as soon as possible. The SCNnode at the region where the client is located receives the informationsent by slingshot from the SCN in the region where the information islocated. This information can be aggregated by an internet facing serverand that server can listen for C-S request queries made by the clientwith responses sent back. Information gathering/retrieval can be aconstant robot at source and as narrow or as broad as client needsdictate and can be dynamically modified per the job from time to time.DBP has an on off toggle switch for each client information job togovern automated operation cycles for the relevant data sets ofinterest. DBP can also be utilized by financial markets or other datasources themselves to make regional access to information from sourceavailable globally.

The DBP information is sent over long distance as a file to PFS in theremote region. The DBP routing is done by writing to PFS in that region.See FIG. 12 for more detailed information regarding routing for the DBPmechanism. Transport over a large distance utilizing slingshot forsending is accomplished by the transferring of a file via RDMA to aremote PFS. This file can be of unlimited size and is transferred inparallel.

DBP also can have fixed or variable ping rates regulated by a modulecontrolling the Granularity of a Tick. The granularity of a tick willdetermine how frequently to pulse send/transmit the information. Thetechnology for the granularity of a tick is described in U.S.Provisional Application No. 62/296,257 and PCT US/16/65856 entitled“SYSTEM AND METHOD FOR INFORMATION SLINGSHOT OVER A NETWORK TAPESTRY ANDGRANULARITY OF A TICK.”

The SCN at various locations at the intersection point of multiple DBPfrom various regions can provide insight into the state of globalmarkets or other globally relevant information. Where ripples of variousbeacon signals indicate information about market movement in one region,analysis by the SCN at the intersection point can provide information totrading computers to start placing trading orders in its local market toobtain a time advantage over traders in other locations.

DBP flashes may send the entire batch of information at one time or justthe differential of information changed from the last DBP flash. Thisfunctionality is dependent on the size of the SCN, its settings, andother factors. Scalability is dynamic and can handle a very high load ofinformation dependent on both the carrying capacity of the underlyingdark fiber or other medium, and on the computing power of the SCN nodesand other configurations.

The financial industry examples indicated herein are only to illustratethe invention. This invention can also be utilized in many otherindustries and/or applications where information from one location isrequired to be transmitted to other locations. Furthermore, DBP isessential where complete information needs to be up to date andreliable, and available rather than bits and pieces of packetizedstreams of data.

FIG. 1 illustrates a client-server (C-S) or peer-to-peer (P2P)Request-Response Framework. This figure describes the informationconveyance between two regions from Region A 1-RegA to Region B 1-RegB.It describes two transmission types. For each type the transmission iseither via a direct link between a Server 1-210 in 1-RegA and a Client1-100 in 1-RegB, or via an intermediary server 1-212.

Server 1-210 is the source of the information and it is in region A1-RegA.

One transmission type is for a multi-cast one way UDP/IP transmissionfrom Server 1-210 to Client 1-100 or from Sever 1-210 to Server 1-212.Once the information is on Server 1-212, it is available for Client1-100 to be accessed via a request-response TCP/IP roundtripcommunication via paths 1-AP02REQ and 1-AP02RESP.

Another transmission type described is for TCP/IP request-responsebetween Server 1-210 and Client 1-100 via roundtrip paths 1-AP06REQ and1-AP06RESP. The relay option sends information between Server 1-210 andServer 1-212 via roundtrip request-response TCP/IP via paths 1-AP04REQand 1-AP04RESP.

There are two methodologies described herein for information conveyancefrom Region A 1-RegA and Region B 1-RegB describe either a UDP/IPmulti-cast via 1-API14CAST to an intermediary server 1-212 or1-API16CAST direct to client 1-100. Another method illustrated is viarequest-response model using TCP/IP via paths 1-AP04REQ 1-AP04RESP toServer 1-212 or paths 1-AP06REQ 1-AP06RESP to Client 1-100.

This illustration is not to scale with respect to distances and for itto make sense 1-T-02 must be smaller than both 1-T04 and 1-T06,indicating that Client 1-100 and Server 1-212 are in the same region.1-T06 is the duration of time (Δt) for direct inquiry. The combinationof 1-T02 and 1-T04 plus whatever processing time needed by Server 1-212is the total time for an inquiry made by local relay. And the functionof Server 1-212 is like that of a CDN server.

Information transmitted from Server 1-210 to Server 1-212 may be byclient server request response C-S REQ-RESP or UDP casting. Informationmay also be transmitted from Server 1-210 to Server 1-212 by filecloning, database record replication, remote publishing of data similarto how a CDN server replicates data, or by C-S REQ-RESP efficient localC-S inquiry to serving.

FIG. 2 illustrates a global virtual network (GVN).

This figure demonstrates prior art of a GVN integrated as anover-the-top (OTT) layer over the internet. Another example embodimentillustrated is a slingshot cluster in the middle 2-RGN-ALL via 2-CPT280and 2-CPT282. FIG. 2 illustrates a global virtual network (GVN) orsimilar globally distributed network using hub and spoke topology withoctagon routing on the backbone, with egress/ingress points (EIP) noted.The octagon shape is for illustrative purposes only—the physicalconstruct can be any shape topology.

FIG. 2 shows the network topology of a GVN in two different regions2-RGN-A and 2-RGN-B and how the regions are connected via paths 2-P0Aand 2-POB through global connectivity 2-RGN-ALL. In addition, FIG. 1demonstrates the hub & spoke connections in each of the two regions. Themultiple egress-ingress points (EIP) 2-EIP400, 2-EIP420, and 2-EIP410,2-EIP430 in each region are added spokes to the hub and spoke model.

SRV_BBX 2-280 and SRV_BBX 2-282 are backbone exchange servers (SRV_BBX)and provide the global connectivity. A SRV_BBX may be placed as one ormore load-balanced servers in a region serving as global links to otherregions. Access point servers (SRV_AP) 2-302, 2-304 and 2-306 in 2-RGN-Aconnect to SRV_BBX 2-280—via 2-L302, 2-L304, and 2-L306, respectively.Access point servers (SRV_AP) 2-312, 2-314 and 2-316 in 2-RGN-B connectto SRV_BBX 2-282—via 2-L312, 2-L314, and 2-L316, respectively.

The central, control server (SRV_CNTRL) 2-200 serves all the deviceswithin that region, and there may be one or more multiple masterSRV_CNTRL servers. The central, control server SRV_CNTR 2-200 canconnect to the backbone exchange server SRV_BBX 2-282 via 2-L200.End-point devices (EPD) 2-100 through 2-110 will connect with one ormore multiple SRV_AP servers through one or more multiple concurrenttunnels. For example, EPD 2-100 through 2-110 can connect to the region2-RGN-A via tunnels 2-P100 through 2-P110.

The central, control server (SRV_CNTRL) 2-202 serves all the deviceswithin that region, and there may be one or more multiple masterSRV_CNTRL servers. The central, control server SRV_CNTR 2-202 canconnect to the backbone exchange server SRV_BBX 2-282 via 2-L202.End-point devices (EPD) 2-120 through 2-130 will connect with one ormore multiple SRV_AP servers through one or more multiple concurrenttunnels. For example, EPD 2-120 through 2-130 can connect to the region2-RGN-B via tunnels 2-P120 through 2-P130.

This figure further demonstrates multiple egress ingress points (EIP)2-EIP420, 2-EIP400, 2-EIP430, and 2-EIP410 as added spokes to the huband spoke model with paths to and from the open internet. This topologycan offer EPD connections to an EIP in remote regions routed through theGVN. In the alternative, this topology also supports EPD connections toan EIP in the same region, to an EPD in the same region, or to an EPD ina remote region. These connections are securely optimized through theGVN. This also facilitates the reaching of an EPD from the open internetwith traffic entering the EIP nearest to the source and being carriedvia the GVN realizing the benefits of the GVN's optimization.

In some embodiments, a host server, a host client, and a DNS server canconnect to an egress ingress point via the internet. Example hostservers include host servers 2-406, 2-412, 2-422, 2-432 that can connectto the internet 2-400, 2-410, 2-420, 2-430 via 2-P-406, 2-P-412,2-EIP-422, 2-P432, respectively. Example host clients include hostclients 2-402, 2-416, 2-426, 2-436 that can connect to the internet2-400, 2-410, 2-420, 2-430 via 2-P402, 2-P416, 2-EIP426, 2-P436,respectively. Example DNS servers include SRV_DNS 2-404, 2-414, 2-424,2-434 that can connect to the internet 2-400, 2-410, 2-420, 2-430 via2-P404, 2-P414, 2-EIP424, and 2-P434.

RGN means Ring Global Node(s) or Regional Global Node(s). RGN_ALL meansAll linked Global Nodes. “Managed by MRGN” means Manager of RegionalGlobal Nodes or Mesh of Regional Global Nodes.

FIG. 3 illustrates the packet bloat for IP transport packets whenheaders are added to the data at various layers. This figure describesthe packet bloat for IP transport. At the Application Layer 3-L04, thedata payload has an initial size as indicated by Data 3-D4. The size ofthe packet is indicated by Packet Size 3-PBytes. At the next layer,Transport Layer 3-L03, the Packet Size 3-PBytes has the original size ofthe data 3-D4 which is equal to Data UDP 3-D3. It further includes bloatof Header UDP 3-H3. At the next layer, Internet Layer 3-L02 the bodypayload Data IP 3-D2 is a combination of 3-D3 and 3-H3. It increases3-PBytes by Header IP 3-H2. At the Link Layer 3-L01, Frame Data 3-D1 isa combination of 3-H2 and 3-D2. It further increases 3-PBytes by HeaderFrame 3-H1 and Footer Frame 3-F1.

FIG. 4 illustrates the packet bloat of data and headers at each of theseven layers of the OSI model. The original data 4-D0 grows at eachlevel Application OSI Layer 7 4-L7 with the addition of headers such asHeader 4-H7. At each subsequent layer, down from layer 7 to layer 1, thedata layer is a combination of the previous upper level's layer of Dataand Header combined. The total packet bloat in an OSI model at thePhysical OSI Layer 14-L1 is denoted by Packet Size 4-PBytes.

FIG. 5 illustrates layers under the Internet (UTI) mapped to Over theTop (OTT) layers. This figure indicates where the data beacon pulser(DBP) fits into a topological hierarchy. OTT¹ indicates first degreeover-the-top of the internet. OTT² indicates second degree over-the-topof the internet meaning that it is over-the-top of an OTT¹ element. UTI¹indicates first degree under-the-internet layer. UTI² indicates seconddegree under-the-internet layer which is below the UTI¹ element.

GVN 5-82 is a global virtual network (GVN) which is built upon the basicplumbing of the Base Internet 5-TOP80, for example ISP connectivity5-80. The DBP is a second degree UTI as noted by Beacon 5-88 UTI²5-UNDER88. It utilizes the UTI¹ technology of slingshot 5-86.

An example of second degree OTT of MPFWM 5-84 is noted for examplepurposes only.

FIG. 6 illustrates Slinghop with the composition of a file as clump ofpackets. This figure describes a carrier file sent via slingshot fileconsisting of a payload of packets in the Payload Body Data 6-200. Thisexample embodiment describes a carrier file of data organized in threedefined sections: Header Information 6-100, Payload containing Body Data6-200, and a Footer 6-300. This carrier file could be stored in RAM,memory, saved to disk, or otherwise stored in another form of memory orstorage.

The Header Information 6-100 can contain information about host origin,host destination, timestamp, and other information. Security informationcan be stored in fields in either the Header Information 6-100, theFooter Information 6-300, or both. This security information may holdreferences to keys to use for decryption, as well as other information.

Payload (Body Data) may be encrypted in whole or in part or sentunencrypted. Payload checksum in the footer is used to validate theintegrity of the body data. EOF notation in the Footer will indicatethat the file has arrived, is complete and ready to bevalidated/verified for accuracy and then ultimately used.

This figure illustrates various small packets such as Packets 6-A, 6-C,6-D, or 6-E, or larger packets such as large Packet 6-B or extra-largepacket 6-F. These are combined when file is created and are separatedinto separate packets when the file is accessed and utilized. The size,number, and composition of packets in the payload 6-200 are for exampleand illustrative purposes only and in practical use, the number, size,configuration of elements within the payload are different and varied.Total file size 6-000 can be the sum of header information size, payloadsize, and footer size.

FIG. 7 illustrates an example of Slinghop information flow. This exampleembodiment describes how Slingshot can be utilized as a Slinghop withineither a global virtual network (GVN) for long distance transport viahops 7-E to 7-I or back from 7-P to 7-T or even integrated into aregular internet path.

At the core of slingshot are backbone exchange servers (SRV_BBX) andsling nodes (SLN) 502 and 506 operating as follows. Data to be Slingshotfrom region where SRV_BBX SLN 502 is located to the region where SRV_BBXSLN 506 is located is transferred via a file write 7-F using remotedirect memory access (RDMA) to a parallel file system (PFS) device inremote region 606. The SRV_BBX SLN 506 in the remote region periodicallychecks the PFS 606. If there is a new file there, it is used by theSRV_BBX SLN 506.

Traffic destined for SRV_BBX SLN 502 is sent back by SRV_BBX SLN 506from 7-Q using RDMA to a parallel file system PFS 602 where the it willbe read by SRV_BBX SLN 502.

The steps 7R and 7G are the stage when the files are read from the PFSby the Read Queues RQ502 and RQ506 respectively. These can select one ofvarious folders. One folder may be read more frequently than another (ahigher priority and or QoS), and the folder can also say which type offiles where saved there, and from which source region, and even sender,or other information. Therefore, the control over and classification offiles can be based on the folder name where the files were saved by theWrite processes 7-F and 7-Q respectively.

FIG. 8 illustrates the synchronization of pulling of batches of files.This figure demonstrates the reading of batches of files from the PFS8-201.

Sling batch file processing Batch Pulls A 8-5200, B 8-5210, and C 8-5220will pull complete files in batches and then use them 8-5202/8-5206,8-5212/8-5216, and 8-5222/8-5226 by processing the files in parallelstreams for maximum efficiency and to make sure that all files areprocessed as quickly as possible. This also ensures that no files shouldwait in line behind other files.

There is a delay 8-5102 between batch pull 8-5200 (occurring duringinterval A 8-5100) and 8-5210 (occurring during interval B 8-5110).There is also a delay 8-5112 between 8-5210 (occurring during interval B8-5110) and 8-5220 (occurring during interval C 8-5120). These delaysallow for batches of fully received files to be read and used files tobe marked as used to avoid duplicate pulls.

Files that are not fully received during one interval, can be processedin subsequent batches. In this example files 8-06, 8-10, 8-12, and 8-14,started arriving during one batch pull but were not used because theywere incomplete. However, these files were read during subsequent batchand used in that next batch pull.

File 8-16 was partially received by Batch Pull C 8-5220 but as it wasincomplete was ignored.

FIG. 9 illustrates a file with payload body data section consisting ofvarious content types. This example embodiment describes a carrierfile's payload body data 9-200 section which contains various kinds ofcontent types, including a data array, files over various sizes, as wellas various sized packets.

The file consists of three file sections: Header, Payload and Footer.The Header and Footer can contain previously described HeaderInformation 9-100 and Footer Information 9-300. Total file size 9-000can be the sum of header information size, payload size, and footersize. The Payload consists of body data 9-200 which can contain dataarrays 9-A, Files 9-02 9-04 9-08, and packets 9-B 9-C. Other featurescan take advantage of the flexibility offered.

A significant advantage is that there can be an algorithm incorporatedwithin the payload which gets sent as part of the payload. For example,in a financial markets context, this algorithm can contain an exitcondition which is a set of instructions to take one or more prescribedactions if market conditions change—with algorithmic instructions toevaluate the direction of market change and then modify instructionsaccordingly. For example, to Cancel out, Reverse, Intensify, orotherwise change the instructions.

This example embodiment demonstrates only some possible uses for thismulti-content payload of the carrier file, and other uses not noted butsent by DBP are possible.

FIG. 10 illustrates Slingshot with End Points Pairs (EPP) Topologyoverlaid on map of northern hemisphere. This figure demonstrates thegeographic placement of a few global nodes of a GVN, and exampleconnectivity paths. For illustrative purposes, the lines are drawn asstraight lines between points.

Due to political/administrative boundaries, cities limits, zoning,geographic features such as bodies of water, various elevation changes,and other reasons, the actual routes of pipes are rarely ever straightor direct. However, the additional distance caused by path deviationsfrom the potentially most direct route do not add enough distance tohave a significantly adverse effect of added latency. It is assumed thatthe lines follow the most optimal path possible, and enhancements hereinfocus on efficiency of utilization of these lines.

For illustrative purposes, segments can be described as city or locationpairs and for Slinghop purposes, the origin end-point of the Slinghop isrepresented by an IP Address or hostname or other label of a server orgateway device there, with segment transiting over the Slinghop segmentto IP address or hostname or other label of the server or gateway deviceat the target end-point city/location. Transit from one location to theother is as simple as from origin IP address to target IP address andfor the return path the IP addresses are in reciprocal order. Thissingle Slinghop segment replaces many other IP segments over theinternet and is optimized by Slingshot.

PFS naming can be based on last octet or last 2 octets of an IP addressor other such label such as hostname, or other label naming scheme. PFSnaming can also include city code, region, IP Address, noted worldnodes, and more factors. IP address pairs denoting bridgeheads at eitherend of a segment. For example, from 188.xxx.xxx.100 to 188.xxx.xxx.112means that Slingshot will write to PFS 10-612, or in other terms,traffic from New York City N.Y.C 10-00 will be directly written to a PFS10-612 in London LDN 10-12. And for return traffic from 188.xxx.xxx.112to 188.xxx.xxx.100 means that Slingshot will write to PFS 10-600, or inother terms, traffic from London LDN 10-12 will be directly written toPFS 10-600 in New York N.Y.C 10-00.

Like airline routes for roundtrips, the combination of two one-waysegments constitute a Slinghop transparent roundtrip integration nestedinto an existing IP pathway. And to further this analogy, sling-routedtraffic can be one way and or to various routes concurrently.

In the event of failure of one link such as 10-P1226 from London LDN10-12 to Tokyo TOK 10-26, Slingroute can either save data to HKG 10-28and then save this data to TOK 10-26 or it can relay through HKG 10-28for save to TOK 10-26. Other such re-directs and re-routes can beutilized by Slingroute to get data to destination if the most directpath is compromised or otherwise unavailable.

FIG. 11 illustrates Slingrouting with a ring of global nodes. Thisfigure demonstrates the Slinghop internals and operations with respectto topological structure. This figure is not to scale nor is theoctagonal shape of any significance other than being able to organizeinformation for human visual understanding. It demonstrates how backboneexchange servers (SRV_BBX) and sling nodes (SLN) 11-502 through 11-516can access and write to various PFS devices such as PFS 11-602 throughPFS 11-616. They are all connected via an internal backbone of variousjoined segments 11-P502 through 11-P516.

As an example, it shows how the Slinghop can integrate with a GVN andsome of its devices such as an access point server (SRV_AP) 11-302, anend-point device (EPD) 100, and a central control server (SRV_CNTRL)200. The circles with an E represent an egress-ingress point (EIP) to anEPD. The circles with a C represent an EIP to an SRV_CNTRL. Similarconfigurations can be available for other access point servers SRV_AP11-304 through 11-316, other backbone exchange servers and sling nodesSRV_BBX/SLN 11-504 through 11-516, and other paths or links 11-P102through 11-P116, 11-P202 through 11-P216.

The octagonal shape is not of material significance and is presented forillustrative purposes only. The actual shape may or may not be in a ringshape, or will take on other shape(s).

FIG. 12 illustrates Slingrouting with Targeted Write to PFS to routetraffic. FIG. 12 is based on FIG. 11 with some exceptions. Differencesbetween these example embodiments are that most of the bridgehead nodepoints are faded. This is to highlight interaction between twobridgehead node points denoting Slinghop connectivity from Region 212-ZN02 to Region 10 12-ZN10 via SRV_BBX/SLN 12-502 to write via RDMAdirectly to PFS 12-610 with SLN/SRV_BBX 12-510 reading the carrier fileand using it in Region 10 12-ZN10. Reciprocal traffic in the otherdirection from Region 10 12-ZN10 to Region 2 12-ZN02 is written via RDMAby SRV_BBX/SLN 12-510 to PFS 12-602. The carrier file is read bySRV_BBX/SLN 12-502 to be used there.

These bridgeheads are bolded to highlight their place and focus. IPaddresses are noted for illustrative purposes X.X.X.02 at 12-502 andX.X.X.10 at 12-510 as either end. Slinghop is therefore from Region 212-ZN02 to Region 10 12-ZN10 by IP order of X.X.X.02 to X.X.X.10, andback from Region 10 12-ZN10 to Region 2 12-ZN02 via IP order of X.X.X.10to X.X.X.02.

In practical use, all connected nodes can concurrently connect with PFSdevices in all other regions and locations. This figure focuses on theexample embodiment of one two-way Slingroute.

FIG. 13 illustrates one example of the Data Beacon Pulser (DBP)mechanism framework and flow. This example demonstrates how DBP canutilize Slingshot to make information from a source region 13-310available to a client 13-100 in another region in as timely a fashion aspossible. As both info source server (S_Info_Source) 13-310 and Client13-100 are connected via the internet, two servers in close proximity toeach negotiate with them using standard internet protocols such asTCP/IP and UDP/IP.

The server making inquiries or receiving and incorporating multi-caststreams (SRV_INC 13-300) can connect through a GVN 13-322 to an accesspoint server SRV_AP 13-302, or it can also connect directly with thebackbone exchange server (SRV_BBX) and sling node (SLN) 13-502. The DBPuses slingshot to write a carrier data file from write queue 13-WQ502via path 13-W606 using RDMA to parallel file system device (PFS) 13-606.The read queue 13-RQ506 on SRV_BBX SLN 13-506 fetches the file from PFS13-606. This file can be conveyed via SRV_AP 13-306 to GVN 13-326 ordirectly to info server (SRV_INFO) 13-306. SRV_INFO 13-306 acts as ahost of the information for client 13-100 to access via 13-AP02REQ and13-AP02RESP. Similarly, data traveling in the reverse direction can bewritten from write queue 13-WQ506 to PFS 13-602 via path 13-W602 andwill be read by read queue 13-RQ502.

This example embodiment also demonstrates important measures of theduration of time. For example, the duration of time Δt 13-T08 denotesthe transport phase of slingshot and is as close to wire speed aspossible. Δt 13-T02 measures the duration of time for SRV_INC 13-300 toeither receive the cast or to fetch info from 13-310. Δt 13-T06 measuresthe duration of time for information to be conveyed from SRV_INC 13-300to SRV_BBX SLN 13-502 for conveyance by slingshot. Δt 13-T16 measuresthe duration of time for the file to be read in the remote region andused. Δt 13-T12 measures the duration of time for the conveyance of thefile to the SRV_INFO 13-306 for access by the client.

The total time for DBP is measured by the following equation:

Total time=Δt 13-T02+Δt 13-T06+Δt 13-T08+Δt 13-T16+Δt 13-T12

There is a certain amount of time delay added by the DBP framework. Thisis overcome by the significant efficiency gain by reducing the durationof time Δt 13-T08.

FIG. 14 illustrates the round-trip-time for transmitting marketinformation. This example embodiment demonstrates an example of securityor commodity or other market information and trade execution using acombination of UDP/IP multi-casting and TCP/IP RTT. It illustrates theduration of time for information to reach a client and for that clientto send a trade instruction based on the information. The 67 ms noted in14-RTT02 and 14-RTT04 is the current best round-trip-time (RTT) offeredby providers of financial lines between New York and London.

The Offset 14-OFF06 further illustrates the absolute minimum responsetime from information dissemination to trade order presentation.

FIG. 15 illustrates the timing for transmitting market information withdata beacon pulser and slingshot. This example embodiment demonstratesthe transmission of market information via data beacon pulser (DBP) andtrade execution using powered by slingshot.

The native advantages of slingshot reduce required time for one-waytransport with high reliability and data rich conveyance. Consequently,information is available faster than via traditional IP based methods.Trade execution request is slingshot back to market very rapidly.

Because DBP constantly sends information as pulses of information, thereare significantly more information sources and durations of time frominfo receipt to trade order presentation are shorter.

15-BL02, 15-BL04, 15-BL06 are examples of compressed reaction timesenabling faster trade execution. As compared to offset 15-OFF06 fortraditional trade info receipt through to RTT for trade order and RTTfor trade confirmation, the advantages of DBP and slingshot are obviousand evident.

FIG. 16 illustrates the timing for transmitting market information withdata beacon pulser. This example embodiment demonstrates the data beaconpulser (DBP) by itself. It is an example only illustrating security orcommodity or other market information and trade execution utilizingbeacon and slingshot one way sending.

The pulses are received regularly. In this example, they are spacedapart at large intervals—this was done to simplify the presentation. Inreal world application, DBP can send pulses multiple times per ms. A keypoint is that information is as current as near wire speed betweensource and querying target. And trade presentation hits the market alsoat as quick to wire speed as possible.

FIG. 17 illustrates the round-trip-time for transmitting marketinformation and the timing for data beacon pulser. This exampleembodiment compares traditional IP based trade information multi-castingand RTT TCP/IP trade execution requests against data beacon pulser(DBP). It is aligned with a start based on pricing at a certain momentof time.

This example compares RTT vs Beacon for information and slingshot fortrade execution/slingshot for trade confirmation. 17-Start relates tothe delivery of market information by Beacon. 17-Mid is the time for thetrade execution order to be placed. 17-End is the time for the tradeconfirmation to be received.

In short, this figure demonstrates that the trade order by DBP ispresented to market well in advance of an equivalent trade order bytraditional IP methods.

FIG. 18 illustrates a series of data beacon pulses. This exampleillustrates the data beacon pulser mechanism in pulsing mode producing aseries of pulses at either a set frequency or variable durations oftime. A pulse could also be referred to as a flash or a series offlashes. Beacon pulses are transmitted from origin like ripples ofinformation to targets. They can be sent to one or more PFS 18-S502storage devices of access and use by backbone exchange server (SRV_BBX)and sling node (SLN) 18-SL-502 in a remote region.

Each flash can contain a carrier file consisting of a complete marketsnapshot at each moment, or it can also carry only the informationchanged since last pulse was sent. As noted above, the utility value ofDBP to financial markets is presented as one use case example. DBP hasutility value to many other industries and applications.

FIG. 19 illustrates simultaneous data beacon pulses. This exampleillustrates the simultaneous sending of multiple duplicate Beacon pulsesmulti-cast to various targets at different distances. Like UDP/IPmulti-cast it is sending streams of information, but where it differs isthat this mechanism is more reliable and more efficient running at closeto wire-speed regardless of distance or data size being transmitted.

The utility value could be for stock trading, dissemination of changinginformation such as weather, wind speed, pollution measures, CDNreplication, or other information sending across any distance by anyindustry.

Another perspective is that it is a multi-directional/multi-destinationconcurrently sending of DBP batches. Near widespread informationconveyance can be regionally aggregated on local servers withavailability to all clients in each of one or more remote regions whereclients in each region can access servers which are fed information byDBP. These servers can serve this information to the clients viatraditional RTT C-S framework there allowing for full integration intoexisting IP-based network work flows while still realizing theadvantages of DBP over the long-haul distances.

FIG. 20 illustrates the intersection of multiple pulses and flashes.This example illustrates data beacon pulser (DBP) at the intersection ofmultiple pulses and flashes. Example of DBP intersection points presentsan advantageous positioning of a super computer node (SCN) or highperformance computing node (HPC) for evaluating information about threeor more markets, in this example, two remote and one local.

London LDN 20-11 is the most equidistant point between the three marketsof New York N.Y.C 20-01, Tokyo TOK 20-21, and London LDN 20-11.Therefore, there is a slight time advantage to trade from the one of thethree places with the SCN or HPC located in London LDN 20-11. If theinformation from all three markets is important and can often originatefrom any one market, the best location is based on weighting the sourceof information, and also where the client trades most locally, usinginformation from other markets.

The area highlighted by 20-222 demonstrates the time advantage oflocating the central node in London where there is a location distanceadvantage of 801 miles 20-Δt222 which equals a savings of 6.3 ms. Thisdemonstrates the information advantage that London has between the threefinancial markets of New York, London and Tokyo.

FIG. 21 illustrates the timing for an example stock trade. Whileslingshot powered data beacon pulser (DBP) can be beneficial in variousapplications, as an example, its utility value in financial applicationsis illustrated herein. This industry needs reliability with as fast andefficient data transport as possible. Often, the first to getinformation and to be able to act on it is the one that has theadvantage and therefore wins out over those who are slower or lessinformed.

This example compares the traditional internet (RTT) request-responseseries 21-NET-04 of REQ-RESP loops versus Data Beacon Pulser (DBP)powered by slingshot 21-NET-08. In each column, there are threehighlighted stages for a trade which are information conveyance, tradeexecution order, and trade confirmation.

In each column are a client 21-A00 and 21-A20 in region A 21-RegA and asource 21-B00 and 21-B20 in region B 21-RegB. This is illustrated as agreatly simplified network topology to focus on the long-distance hopsbetween region A 21-RegA and region B 21-RegB.

Internet (RTT) 21-Net04 from Region A 21-RegA to Region B 21-Reg B andback to Region A 21-RegA utilizes packetized data with an assumed smallpacket size within the MTU of 1500 or 576. The first stage in thisinternet RTT column is a request for information path from point 21-A02by client 21-A00 to 21-AP00REQ Source 21-B00 point 21-B03 with a return21-AP00RESP to point 21-A04. The second stage is a trade executionrequest made via point 21-A06 by client 21-A00 to 21-AP02REQ Source21-B00 point 21-B07 with a return 21-AP02RESP to point 21-A08. The thirdstage is for a trade confirmation request made via point 21-A10 byclient 21-A00 via 21-AP04REQ to Source 21-B00 point 21-B11 with a return21-AP04RESP to point 21-A12.

In the case of Data Beacon Pulser (DBP) combined with slingshot21-Net08, the information is a series of one-way transfers. DBP sendscomplete files and has no limit to file sizes without a need forpacketization nor does it require multi-part payloads that would have tootherwise be carried by multiple packets.

An example of multiple DBP pulses illustrating the stage one market datainformation conveyance is noted by 21-AP22DBP, 21-AP24DBP, 21-AP26DBP,and 21-AP28DBP. These are published by the Source 21-B20 in region B21-RegB and received by client 21-A20 in region A 21-RegA on an ongoing,regular basis. Information may consist of a snapshot of entire datasetor this information could also be a differential of changes made to theinformation since the sending of previous data set.

There are two stage two trade execution request submissions illustratedby 21-AP36TRADE and 21-AP56TRADE from client 21-A20 in region A 21-RegAsent to source 21-B20 in 21-RegB. There are also two stage three tradeconfirmations illustrated by 21-AP38CONF and 21-AP58CONF from source21-B20 in 21-RegB sent to client 21-A20 in region A 21-RegA.

There are two timelines 21-Time04 and 21-Time08, both starting at thesame instant, each from 0 ms with 10 millisecond (ms) intervals goingdown this illustration up to 200+ms. While the actual geographiclocations are not indicated herein, the latency between points issimilar to the latency between two major financial hubs of New York andLondon. Internet 21-Net04 RTT is at least 65 ms and averages about 73 msbetween these two points. Beacon and Slingshot one way transport are atleast 30 ms one way.

Markets move based on changes to information causing either supply tooutstrip demand putting downward pressure on pricing or converselycausing demand to outstrip supply pushing pricing upwards. In thisillustration, if news happens at time κ ms, a client using RTT 21-Net04will make a request starting at point 21-A02 and this request will befulfilled by source 21-B00 at point 21-B03, and the earliest that theywill receive information is at point 21-A04.

The client 21-A20 who is on the receiving end of data beacon pulser21-Net08, will have received four or more intervals of information viaDBP. The actual frequency can be much more often. A few key points arewith regards to where information which could move markets originates.Another point to bring up is that the RTT 21-Net04 information requestRTT loops can be much more frequent as well when a client 21-A00 isfocused on a specific market. In that instance, the marginal advantageof DBP and Sling transport provides the advantage of letter its clients21-A20 be first to market compared with 21-A00 clients.

However, in an instance when external information or market movementinformation is the impetus for a request for market information to focuson and on which to base trading decisions, DBP and Sling providesignificant advantages. Whether the information is first known in RegionA 21-RegA or Region B 21-RegB, FIG. 21 illustrates the advantage of DBPand Sling.

If the information originates in Region B 21-RegB at 0 ms, it is knownto client 21-A20 in Region A 21-RegA via 21-AP22DBP at point 21-A22 justover the 30 ms mark, and the client 21-A20 can respond by placing atrade order via 210AP36TRADE which is received by the market at justover the 60 ms mark at point 21-B36. Confirmation of the trade isreceived by the client 21-A20 at approx. the 90 ms mark at point 21-A38.At the earliest time that client 21-A00 receives market pricinginformation 21-A04, client 21-A20 has already received more marketinformation and can choose to place another trade order at point 21-A30via 21-AP56Trade to be executed by market at point 21-B56. The timelierand more thorough the information, the greater the advantage to thetrader.

FIG. 21 is not to scale. There will be a more pronounced time advantageover longer distance. Therefore, the granularity of the time advantagemust be measured in finer measurement units within shorter pathdistances. One other factor is that RTT internet packets are sent on abest efforts basis and timing is expectant. DBP and Slingshot aredeterminate in that the transport is reliable and time known.

The time advantage offered by DBP and Slingshot example in the financialworld can also be advantageous in other use case scenarios.

FIG. 22 illustrates the timing for an example stock trade. This figureis like FIG. 21 with added example embodiments to illustrate thepacketization transport of internet (RTT) 22-Net04 versus the any-sizedfile payload transport of DBP and Slingshot 22-Net08.

Packets 22-A, 22-B, and 22-C must be smaller than the maximumtransmission until of all hops in the internet path through which theytransit. This is typically 1500 bytes. That means that any data which islarger than that or series of data will require multiple packets. Whenreceiving information, it requires the aggregating of packetized dateand analyzing. When sending a series of instructions, such as tradeorders, it requires sending multiple orders from client to market.

The combined file payload of a sling packet 22-BB can contain manydifferent data elements, such as a data array 22-DA00, or various sizedfiles such as 22-FLOO, 22-FL02, or 22-FL08. This has the advantage ofreceiving information in bulk for a more comprehensive view as well asoffering the facility to send more complex trading information, such asan algorithm to be processed as close to market as possible.

This is paradigm shift offers traders more options, flexibility andadvantages.

FIG. 23 illustrates the timing for an example stock trade. This figureis based on both FIG. 21 and FIG. 21. It simplifies the comparisonbetween internet RTT 23-Net04 and Beacon and Slingshot 23-Net-08.Efficiency gain is made over the complete information cycle.

FIG. 24 illustrates the granularity of a tick. This figure illustratestwo ticks 24-T08 and 24-T18 as consistent beacon intervals. This exampledemonstrates two batch file pulls on a backbone exchange server(SRV_BBX) with Read Queue+Process 24-RQP00 and Read Queue+Process24-RQP10. They both pull files from the same storage media parallel filesystem PFS Incoming Files 24-606. Files pulled in 24-RQP00 via path24-RQP606 are processed and then in post processing Post P 24-Q00 thefiles are marked via path 24-Q606.

This is a critically important point because the next batch file pullRead Queue+Process 24-RQP10 from PFS Incoming Files 24-606 via path24-RQP616 should only include unmarked files or files not filled byprevious batches. Then at Post P 24-Q10 the files pulled and used aremarked via path 24-Q616 so that they will not be inadvertently pulled bya subsequent batch file pull.

FIG. 25 illustrates how the GVN can incorporate technologies such asNetwork Slingshot. This example illustrates the topology of DBP andSlingshot integrated into a framework such as a GVN or other suchstructure including sling node (SLN) 25-538, information server(SRV_INFO) 25-388 and other devices. DBP and Slingshot can either bestandalone or work within existing network fabrics.

The first boundary is GVN EIP 25-322 between the internet and the GVN.The next boundary is the secure perimeter 25-182. This layered securityapproach protects the core infrastructure which the GVN is predicatedupon.

The secure perimeter 25-182 boundary between GVN and GVN backboneprotect the high speed global network. The section of the GVN above theperimeter 25-822 has traffic flowing over the top (OTT) the openinternet via secure GVN tunnels. Under the secure perimeter 25-182, GVNconnections utilize various protocols over dark fiber or otherconnectivity which are not directly reachable from the internet.

A sling node 25-538 can operate inside of (below) the secure perimeter25-832 which can operate a true internal network with advanced featuressuch as remote direct memory access (RDMA) to a parallel file system(PFS) 25-602 device.

FIG. 26 illustrates a system diagram with Beacon and other logic. Thisexample embodiment demonstrates the stack of three devices, an accesspoint server (SRV_AP) 300, a central, control server (SRV_CNTRL) 200,and a backbone exchange server (SRVBBX) sling node (SLN) 500, plusSRV_AP 16-388-6 and 16-388-8.

At SRV_BBX SLN 500, may also have one slingshot devices between it andthe internet path. In this topology, SRV_BBX is infrastructure betweeninternet and the backbone utilizing two reciprocal mechanisms. Theslingshot router scan act as a path enabler for one way or two way DBP.For example, in the internet data center (IDC), there can be a series ofslingshot routes as a front face. This mechanism can be configured forslingshot and it can be administered.

SRV_CNTRL 200 can include one or more of the followingmodules/components parts: HFS File Storage S602, Global File ManagerS280, Fabric S276, Repository S278, GVN Managers S272, GVN Modules S270,Resources Manager S268, GUI S264, File Mgmt S260, SEC S264, Cache S252,ASR S250, DNS S254, CDA S258, FW S244, Connect S238, Beacon ManagerS288, Sling Manager S236, Logging S250, ACC S232, Db S220, Host S222,API S230, GVN Software S212, Operating System S210, RAM S206, CPU S202,and NIC S208. SRV_CNTRL 200 can communicate with Db 5502A and/or RepDb5502B.

SRV_BBX 500 can include one or more of the following modules/componentsparts: HFS File Storage S605, Global File Manager S580, Fabric S576, SecPerim S574, GVN Managers S572, GVN Modules S570, Resources Manager S568,GUI S564, File Mgmt S560, SEC S564, Cache S552, ASR S550, DNS S554, CDAS558, Connectivity S538, Slingshot+Slinghop S536, Logging S550, ACCS532, Db S520, Host S522, API S530, GVN Software S512, O/S S510, IB-NICS518, RAM S506, CPU S502, and NIC S508. SRVBBX 500 can communicate withDb S503. PFS File Storage Clusters S802, S806, S808 can communicate withGlobal File Manager S580 and/or Slingshot+Slinghop S536.

SLN 900 can include one or more of the following modules/componentsparts: HFS File Storage S606, Global File Manager S980, Fabric ManagerS976, GVN Managers S972, GVN Modules S970, Resources Manager S968,Beacon S988, Availability S980, Slingshot Engine S936, Logging S950, ACCS932, Db S920, Host S922, API S930, GVN Software S912, O/S S910, RAMS906, CPU S902, and NIC S908. SLN 900 can communicate with Db S501.

SRV_AP 16-388-6 can include one or more of the followingmodules/components parts: Beacon Manager S388-68, Beacon AggregatorS388-66, Beacon F BOT S388-62, Beacon CPA S388-64, Beacon PulserS388-60. SRV_AP 16-388-8 can include one or more of the followingmodules/components parts: Beacon Manager S388-88, Beacon AggregatorS388-86, Beacon Host S388-82, Beacon CPA S388-84, Beacon ReceiverS388-80. Beacon Pulser S388-60 can communicate with Beacon ReceiverS388-80.

Some key elements have been highlighted. More elements may be presentwhich have not been noted. Some of the elements noted are not directlyinfluenced by, dependent on, or otherwise integrated with Slinghop buthave been noted to show where in the stack that that items may beplaced. The hierarchy and placement of items may indicate levels withelements near the top as high level items, and items at the bottom aslower level items. For example the network interface card (NIC) S108,S308, S208, and S508 are all at a very low system level. The OperatingSystem (O/S) S110, S310, S210, and S510 are above the NIC level andwithin the O/S there are driver files which interface with and operatethe NIC. Some elements noted (and others not noted) may be at theappropriate level relative to other elements or they may need to belower or higher, depending on use, context and other factors.

Other elements of GVN, slingshot, Slinghop or other related technologiesalso include fabric manager, logging, AI, security, FW, secure bootmanager (SBM), back channel mechanism (BCM), geographic destination(Geo-D), Resources Manager, GVN Modules, APPs, advanced smart routing(ASR), GVN Manager, Accounting, and others.

Slingshot manager manages hop listener, file buffer module (receive),file buffer manager (send), hop router, file sender, and other items.

It is to be understood that the disclosed subject matter is not limitedin its application to the details of construction and to thearrangements of the components set forth in the following description orillustrated in the drawings. The disclosed subject matter is capable ofother embodiments and of being practiced and carried out in variousways. In addition, it is to be understood that the phraseology andterminology employed herein are for the purpose of description andshould not be regarded as limiting.

As such, those skilled in the art will appreciate that the conception,upon which this disclosure is based, may readily be utilized as a basisfor the designing of other structures, systems, methods and media forcarrying out the several purposes of the disclosed subject matter. It isimportant, therefore, that the claims be regarded as including suchequivalent constructions insofar as they do not depart from the spiritand scope of the disclosed subject matter.

Although the disclosed subject matter has been described and illustratedin the foregoing exemplary embodiments, it is understood that thepresent disclosure has been made only by way of example, and thatnumerous changes in the details of implementation of the disclosedsubject matter may be made without departing from the spirit and scopeof the disclosed subject matter, which is limited only by the claimswhich follow.

1. A network system for providing data beacons, comprising: a first nodecomprising a first read queue, a first write queue, and a first parallelfile system; a second node comprising a second read queue, a secondwrite queue, and a second parallel file system; wherein the first nodewrites first data from the first write queue to the second parallel filesystem; and wherein the second node reads the first data from the secondparallel file system and places the first data in the second read queue.2. The network system of claim 1, wherein the second node writes seconddata from the second write queue to the first parallel file system; andwherein the first node reads the second data from the first parallelfile system and places the second data in the first read queue.
 3. Thenetwork system of claim 1, wherein the first data is a carrier filecomprising a header, a body, and a footer.
 4. The network system ofclaim 3, wherein the first nodes subsequently writes additional data tothe first parallel file system.
 5. The network system of claim 4,wherein the additional data is written at a set frequency.
 6. Thenetwork system of claim 4, wherein the additional data only containsinformation that has changed since the first data was written.
 7. Thenetwork system of claim 1, further comprising a third node comprising athird read queue, a third write queue, and a third parallel file system;wherein the first node writes first data from the first write queue tothe second and third parallel file systems at the same time; and whereinthe third node reads the first data from the third parallel file systemand places the first data in the third read queue.